Human-Computer Interactive Annealing for Discovering Invisible Dark Events
نویسندگان
چکیده
Experts of chance discovery have recognized a new class of problems where the previous methods fail to visualize a latent structure behind observation. There are invisible events that play an important role in the dynamics of visible events. An invisible leader in a communication network is a typical example. Such an event is named a dark event. A novel technique has been proposed to understand a dark event and to extend the process of chance discovery. This paper presents a new method named “human–computer interactive annealing” for revealing latent structures along with the algorithm for discovering dark events. Demonstration using test data generated from a scale-free network shows that the precision regarding the algorithm ranges from 80% to 90%. An experiment on discovering an invisible leader under an online collective decision-making circumstance is successful.
منابع مشابه
Interactive Annealing for Understanding Invisible Dark Events
Experts of chance discovery have faced a new problem, where the previous methods fail to visualize a latent structure behind observation. Invisible events play an important role in the dynamics of visible events. They are called “dark events”. This paper proposes a new method named “human-interactive annealing” for revealing a latent structure and understanding dark events and illustrates pract...
متن کاملHuman-Interactive Annealing Process with Pictogram for Extracting New Scenarios for Patent Technology
The latent structure behind an observation often plays an important role in the dynamics of visible events. Such latent structure is composed of invisible events named dark events. Human-interactive annealing is developed to visualize and understand dark events. This paper presents an application of human-interactive annealing for extracting new scenarios for patent technology using the latent ...
متن کاملDetection of invisible nodes in a homogeneous network
Crystallization algorithm to detect invisible nodes in a homogeneous network is studied. The homogeneous network does not possess very large hub nodes. The portion of the data generated from a simulation model, where the invisible nodes are likely to exist, is identified with good precision. This demonstrates that the human-interactive annealing along with the crystallization algorithm can be a...
متن کاملقیدهای تک Z روی مدل ماده تاریک فرمیونی با واسطه شبه اسکالر در LHC
In this research we study the Mono-Z signature along with dark matter production at the LHC in a renormalizable dark matter model. We look at processes with L+L-+MET in the final state. We simulate signal and background events at central mass energy 14 TeV We then evaluate the LHC sensitivities for some points in the model parameter space for two integrated luminosities L=100 fb-1 and L=1 ab-1 ...
متن کاملar X iv : a st ro - p h / 93 04 02 5 v 1 2 8 A pr 1 99 3 Lensing of invisible stars by brown dwarfs
To detect brown dwarfs in the dark galactic halo through gravitational lensing, experiments follow the luminosity of millions of stars to observe a few lensing events per year. The luminosity of a star too faint to be continuously followed can be temporarily increased above the detection limit by a lensing. The detection of these invisible stars would increase the number of events by a factor 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Industrial Electronics
دوره 54 شماره
صفحات -
تاریخ انتشار 2007